例句與造句

1. MAX-2-SAT is NP-hard and it is a particular case of a maximum satisfiability problem.
2. The NP-completeness of the problem can be shown, for example, by a transformation from maximum 2-satisfiability ( a restriction of the maximum satisfiability problem ).
3. Another limitation of the approach is that it applies only to optimization problems and not to " pure " decision problems like satisfiability, although it is often possible to conceive optimization versions of such problems, such as the maximum satisfiability problem ( Max SAT ).
4. It's difficult to find maximum satisfiability problem in a sentence. 用maximum satisfiability problem造句挺難的